Intersection and Union Types in the λμμ̃-calculus
نویسندگان
چکیده
The original λμe μ of Curien and Herbelin has a system of simple types, based on sequent calculus, embodying a Curry-Howard correspondence with classical logic. We introduce and discuss three type assignment systems that are extensions of λμe μ with intersection and union types. The intrinsic symmetry in the λμe μ calculus leads to an essential use of both intersection and union types.
منابع مشابه
Completeness and Partial Soundness Results for Intersection & Union Typing for λμμ̃
This paper studies intersection and union type assignment for the calculus λμμ̃ [16], a proofterm syntax for Gentzen’s classical sequent calculus, with the aim of defining a type-based semantics, via setting up a system that is closed under conversion. We will start by investigating what the minimal requirements are for a system for λμμ̃ to be complete (closed under redex expansion); this coincid...
متن کاملReduction vs Intersection / Union Types in λ μ μ̃
This paper studies intersection and union type assignment for the calculus λμμ̃ [6], a proofterm syntax for Gentzen’s classical sequent calculus. We show that this notion is closed for subject-expansion, and show that it needs to be restricted to satisfy subject-reduction as well, even when limiting reduction to (confluent) call-by-name or call-by-value reduction, making it unsuitable to define ...
متن کاملA Translation of Intersection and Union Types for the λμ-Calculus
We introduce an intersection and union type system for the λμ-calculus, which includes a restricted version of the traditional unionelimination rule. We give a translation from intersection and union types into intersection and product types, which is a variant of negative translation from classical logic to intuitionistic logic and naturally reflects the structure of strict intersection and un...
متن کاملSubject Reduction vs Intersection / Union Types in λμμ̃
The role of Classical Logic in computer science is changing drastically over the last few years. Given the direct relation between the Lambda Calculus (Barendregt 1984) and intuitionistic logic, for many years it was believed that only the constructive logics had any real computational content, and only after Griffi n’s discovery of the relation between double-negation elimination (Griffi n 199...
متن کاملCharacterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage
We develop an intersection type system for the λμμ̃ calculus of Curien and Herbelin. This calculus provides a symmetric computational interpretation of classical sequent style logic and gives a simple account of call-by-name and call-by-value. The present system improves on earlier type disciplines for λμμ̃: in addition to characterizing the λμμ̃ expressions that are strongly normalizing under fre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005